منابع مشابه
Generalized Prioritized Sweeping
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of environment states. To choose effectively where to spend a costly planning step, classic prioritized sweeping uses a simple heuristic to focus computation on the states that are likely to have the largest errors. In this...
متن کاملSweeping out on a Set of Integers
Let (X, ®, m) be a Lebesgue space, m(X) = 1, and let T be an invertible measurable nonsingular aperiodic transformation of X onto X. If S is a set of r integers, r > 2, then there exists a set A of measure less than /•"' S*_! k~l such that X = U,es T"A. Thus for every infinite set of integers W there exist sets A of arbitrarily small measure such that X = U nniv T"A.
متن کاملProbability Out Of Determinism
This paper offers a metaphysics of physical probability in (or if you prefer, truth conditions for probabilistic claims about) deterministic systems based on an approach to the explanation of probabilistic patterns in deterministic systems called the method of arbitrary functions. Much of the appeal of the method is its promise to provide an account of physical probability on which probability ...
متن کاملBroom: Sweeping Out Garbage Collection from Big Data Systems
Many popular systems for processing “big data” are implemented in high-level programming languages with automatic memory management via garbage collection (GC). However, high object churn and large heap sizes put severe strain on the garbage collector. As a result, applications underperform significantly: GC increases the runtime of typical data processing tasks by up to 40%. We propose to use ...
متن کاملGeneralized Probability Smoothing
In this work we consider a generalized version of Probability Smoothing, the core elementary model for sequential prediction in the state of the art PAQ family of data compression algorithms. Our main contribution is a code length analysis that considers the redundancy of Probability Smoothing with respect to a Piecewise Stationary Source. The analysis holds for a finite alphabet and expresses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1968
ISSN: 0022-1236
DOI: 10.1016/0022-1236(68)90018-9